On the fatness of Minkowski sums

نویسندگان

  • Mark de Berg
  • A. Frank van der Stappen
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minkowski Sum of Polytopes and Its Normality

In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.

متن کامل

An Object-Space Method for Calculating the Minkowski Sums of Simple 3D Objects

This paper presents an easy-to-implement and efficient method to calculate the Minkowski Sums of simple convex objects. The method is based on direct geometrical manipulation of planes in 3D space. The paper also explains the translational and topological invariance properties of Minkowski sums, their use in distance calculations and presents some performance results.

متن کامل

Minkowski sum of HV-polytopes in Rn

Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation and V-representation are available i.e. the polytopes are described by both their half-spaces and vertices. The first method uses the polytope normal fans a...

متن کامل

m-Projections involving Minkowski inverse and range symmetric property in Minkowski space

In this paper we study the impact of Minkowski metric matrix on a projection in the Minkowski Space M along with their basic algebraic and geometric properties.The relation between the m-projections and the Minkowski inverse of a matrix A in the minkowski space M is derived. In the remaining portion commutativity of Minkowski inverse in Minkowski Space M is analyzed in terms of m-projections as...

متن کامل

On the Exact Maximum Complexity of Minkowski Sums of Polytopes

We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2002